Tiling a primitive in a graphics processing system

ABSTRACT

In tile-based graphics processing systems, a tiling unit determines which tiles of a rendering space a primitive is in, such that the primitives in a tile can be rendered. A bounding box is determined for the primitive. For each tile boundary between lines of tiles in the bounding box, intersection points of the tile boundary with edges of the primitive are determined and used to determine which of the tiles in the bounding box the primitive is in. In this way the tiling process can be implemented without performing tiling calculations for all of the tiles in the bounding box for a primitive. Reducing the number of tiling calculations can help to improve the efficiency of the graphics processing system (in terms of speed and power consumption) for rendering a primitive.

BACKGROUND

Graphics processing systems are used to process graphics data. Forexample, an application running on a computing system may need to renderan image of a three dimensional (3D) scene for display to a user. Theapplication can send graphics data to a graphics processing system to berendered, wherein the graphics data describes a plurality of primitivesto be rendered. As is known in the art, primitives are usually convexpolygons, such as triangles or convex quadrilaterals, wherein aprimitive typically has its position in the rendering space of thegraphics processing system defined by the position of its vertices, andmay have its appearance defined by other attributes such as colour ortexture attributes. An object in a scene may be represented by one ormore primitives. As graphics processing systems progress, theircapability to render complex images improves, and as such applicationsmake use of this and provide more complex images for graphics processingsystems to render. This means that the number of primitives in imagestends to increase, so the ability of a graphics processing system toprocess the primitives efficiently becomes more important.

One known way of improving the efficiency of a graphics processingsystem is to render an image in a tile-based manner. In this way, therendering space into which primitives are to be rendered is divided intoa plurality of tiles, which can then be rendered independently from eachother. In order to render primitives, a rendering unit uses memory tostore intermediate results (e.g. depth values and primitive identifiers,etc.) for different sample positions in the rendering space. If therendering unit operates on a tile at a time then most (or all) of thismemory can be situated “on-chip”, i.e. on the Graphics Processing Unit(GPU), which might not be possible if the whole rendering space isrendered at once. Therefore, in a tile-based graphics system, the numberof read and write operations between the GPU and an off-chip memory(i.e. which may be referred to as “system memory”) is typically reducedcompared to a non tile-based graphics system. Since read and writeoperations between the GPU and the system memory are typically very slowand use a large amount of power (as compared to operations performedwithin the GPU), tile-based graphics systems are often more efficient(in terms of power and speed) than non tile-based graphics systems. Atile-based graphics system includes a tiling unit to tile theprimitives. That is, the tiling unit determines, for a primitive, whichof a plurality of tiles of a rendering space the primitive is in. Then,when a rendering unit renders the tile, it can be given informationindicating which primitives should be used to render that tile.

For example, FIG. 1 shows some elements of a tile-based graphicsprocessing system 100 which may be used to render an image of a 3Dscene. The graphics processing system 100 comprises a graphicsprocessing unit (GPU) 102 and two portions of memory 104 ₁ and 104 ₂. Itis noted that the two portions of memory 104 ₁ and 104 ₂ may, or maynot, be parts of the same physical memory, and both memories 104 ₁ and104 ₂ may be situated “off-chip”, i.e. not on the same chip as the GPU102. Communication between the memories (104 ₁ and 104 ₂) and the GPU102 may take place over a communications bus in the system 100.

The GPU 102 comprises a pre-processing module 106, a tiling unit 108 anda rendering unit 110. The tiling unit 108 comprises processing logic 112and a data store 114, and the rendering unit 110 comprises a hiddensurface removal (HSR) module 116 and a texturing/shading module 118. Thegraphics processing system 100 is arranged such that graphics datadescribing a sequence of primitives provided by an application isreceived at the pre-processing module 106. The pre-processing module 106performs functions such as geometry processing including clipping andculling to remove primitives which do not fall into a visible view. Thepre-processing module 106 may also project the primitives intoscreen-space. The pre-processing module 106 outputs primitives to thetiling unit 108.

The tiling unit 108 receives the primitives from the pre-processingmodule 106 and determines which of the primitives are present withineach of the tiles of the rendering space of the graphics processingsystem 100. A primitive may be completely in one tile or may overlap twoor more of the tiles of the rendering space. The tiling unit 108 assignsprimitives to tiles of the rendering space by creating display lists forthe tiles, wherein the display list for a tile includes indications ofprimitives (i.e. primitive IDs) which are present in the tile. Thedisplay lists and the primitives are outputted from the tiling unit 108and stored in the memory 104 ₁. The rendering unit 110 fetches thedisplay list for a tile and the primitives relevant to that tile fromthe memory 104 ₁, and the HSR module 116 performs hidden surface removalto thereby remove fragments of primitives which are hidden in the scene.The remaining fragments are passed to the texturing/shading module 118which performs texturing and/or shading on the fragments to determinepixel colour values of a rendered image which can be passed to thememory 104 ₂ for storage in a frame buffer. The rendering unit 110processes primitives in each of the tiles and when the whole image hasbeen rendered and stored in the memory 104 ₂, the image can be outputtedfrom the graphics processing system 100 and, for example, displayed on adisplay. In the example shown in FIG. 1, the tile-based graphicsprocessing system 100 is a deferred rendering system, meaning that therendering unit 110 performs hidden surface removal on a primitivefragment prior to performing texturing and/or shading on the primitivefragment in order to render the scene. However, in other examples,graphics processing systems might not be deferred rendering systems,such that texturing and/or shading is performed on a primitive fragmentbefore hidden surface removal is performed on the primitive.

FIG. 2 shows an example of a rendering space 202 which has been dividedinto an 8×12 array of tiles 204, wherein the tile in the M^(th) row andthe n^(th) column is referred to as 204 _(mn). A primitive 206 isillustrated. The tiling unit 108 operates to determine which of thetiles 204 _(mn) the primitive 206 is in. The primitive 206 is “in” atile 204 if the primitive 206 at least partially overlaps with the tile.The tiling unit 108 determines a bounding box 208 by finding the minimumand maximum x and y coordinates of the three vertices of the primitive206 and forming the box 208 from those coordinates. The tiling unit 108can thereby determine that the primitive 206 is not in any of the tiles204 _(mn) which are not in the bounding box 208. A tile 204 is “in” thebounding box 208 if the tile at least partially overlaps with thebounding box 208. In some examples, the bounding box may be determinedat tile-resolution, whereby the bounding box may be increased in sizesuch that the edges of the bounding box fall on tile boundaries. In FIG.2, the tiles which are dotted (i.e. the top and bottom rows of tiles,the first column and the last two columns of tiles of the renderingspace 202) are outside of the bounding box 208 and therefore, on thatbasis, the tiling unit 108 can determine that the primitive 206 is notin those tiles. In a very simple implementation, the tiling unit 108might simply indicate that the primitive is in all of the tiles in thebounding box 208. However, this means that the primitive is indicated asbeing in some tiles which it is not actually in. This can lead toadditional memory consumption due to the storage of unnecessaryprimitives and/or primitive IDs in memory 104 ₁, and inefficiencies inthe rendering unit 110 as primitives are read from memory 104 ₁ and areprocessed for tiles in which they are not visible. Therefore, it isgenerally preferable for the tiling unit 108 to determine which of thetiles in the bounding the box 208 the primitive is in.

For each tile in the bounding box 208 (e.g. each of the white tiles inFIG. 2) tiling calculations can be performed to determine whether theprimitive 206 is in the tile. For example, the tiling calculations todetermine whether the primitive 206 is in a tile 204 _(m), might includecalculations for each edge of the primitive. For example, as illustratedin FIG. 3, equations representing edge lines (302 ₁, 302 ₂ and 302 ₃)defining the edges of the primitive 206 are determined using thelocations of the vertices (304 ₁, 304 ₂ and 304 ₃) of the primitive 206.Then for each edge line 302, a test can be performed to determinewhether a tile 204 is inside or outside the respective edge line 302 bycomparing a position of a test point in the tile with the equation ofthe edge line 302. The test point in the tile may be different fortesting with respect to different edges, i.e. the test point may beedge-specific. For example, for testing whether a tile is inside edgeline 302 ₁ the test point is in the bottom left of the tile; for testingwhether a tile is inside edge line 302 ₂ the test point is in the topleft of the tile; and for testing whether a tile is inside edge line 302₃ the test point is in the bottom right of the tile. If it is determinedthat the tile is inside all of the edge lines 302 then it is determinedthat the primitive is in the tile. However, if it is determined that thetile is outside any of the edge lines 302 then it is determined that theprimitive is not in the tile.

The tiling calculations may be performed for each of the tiles in thebounding box 208 in order to determine whether the primitive is in therespective tiles. For each edge of the primitive, and for each tile inthe bounding box, the comparison of the position of the edge-specifictest point in the tile with the equation of the appropriate edge linetypically involves performing one or more floating point operations.Floating point operations are costly to perform (in terms of time andpower consumption). This may cause a problem, particularly due to thetendency for the number of primitives in an image to increase, becausethe number of floating point operations involved in the tiling processmay become large enough to significantly detrimentally affect theperformance of the graphics processing system 100. Therefore, it wouldgenerally be beneficial to reduce the time and power that is consumed inthe tiling process.

SUMMARY

This Summary is provided to introduce a selection of concepts in asimplified form that are further described below in the DetailedDescription. This Summary is not intended to identify key features oressential features of the claimed subject matter, nor is it intended tobe used to limit the scope of the claimed subject matter.

There are described herein examples in which the number of tilingcalculations (e.g. involving floating point operations) that areperformed for tiling a primitive may be reduced compared to the priorart examples described in the background section above. This can help toimprove the efficiency of the graphics processing system (e.g. in termsof speed and power) for rendering a primitive.

There is described herein a method of processing a primitive in agraphics processing system, the method comprising tiling the primitiveto determine which of a plurality of tiles of a rendering space theprimitive is in, said tiling the primitive comprising: determining abounding box for the primitive; for each of at least one tile boundarybetween lines of tiles in the bounding box, determining intersectionpoints of the tile boundary with edges of the primitive; and using thedetermined intersection points to determine which of the tiles in thebounding box the primitive is in.

There is described herein a graphics processing system comprising atiling unit for tiling a primitive to determine which of a plurality oftiles of a rendering space the primitive is in, the tiling unit beingconfigured to: determine a bounding box for the primitive; for each ofat least one tile boundary between lines of tiles in the bounding box,determine intersection points of the tile boundary with edges of theprimitive; and use the determined intersection points to determine whichof the tiles in the bounding box the primitive is in.

There may be provided computer readable code adapted to perform thesteps of the methods of any of the examples described herein when thecode is run on a computer. Furthermore, there may be provided computerreadable code for generating a graphics processing system according toany of the examples described herein. The computer readable code may beencoded on a computer readable storage medium.

The above features may be combined as appropriate, as would be apparentto a skilled person, and may be combined with any of the aspects of theexamples described herein.

BRIEF DESCRIPTION OF THE DRAWINGS

Examples will now be described in detail with reference to theaccompanying drawings in which:

FIG. 1 is a schematic diagram of a graphics processing system;

FIG. 2 shows a primitive in tiles of a rendering space;

FIG. 3 illustrates edge lines which define the edges of a primitive;

FIGS. 4a and 4b show a flow chart illustrating a first method ofprocessing primitives in a graphics processing system;

FIG. 5a shows an example of a primitive in a single tile of a renderingspace;

FIG. 5b shows an example of a primitive in a row of tiles of a renderingspace;

FIG. 5c shows three primitives for which bounding boxes have beenclipped to the edges of the rendering space;

FIG. 6 shows a primitive in three tiles of a 2×2 square of tiles of arendering space;

FIG. 7a shows a primitive in a 2×8 rectangle of tiles of a renderingspace;

FIG. 7b shows a primitive which extends beyond the edges of a renderingspace which includes a 4×8 array of tiles;

FIG. 8 shows edge-specific test points in a tile for respective edgeorientations;

FIG. 9 shows an example of a primitive in some of a 9×14 rectangle oftiles of a rendering space;

FIG. 10 shows a flow chart illustrating a second method of processingprimitives in a graphics processing system;

FIGS. 11a to 11d illustrate four different stages of the tiling processof the second method; and

FIG. 12 is a schematic diagram of a computer system.

The accompanying drawings illustrate various examples. The skilledperson will appreciate that the illustrated element boundaries (e.g.,boxes, groups of boxes, or other shapes) in the drawings represent oneexample of the boundaries. It may be that in some examples, one elementmay be designed as multiple elements or that multiple elements may bedesigned as one element. Common reference numerals are used throughoutthe figures, where appropriate, to indicate similar features.

DETAILED DESCRIPTION

Embodiments will now be described by way of example only.

The graphics processing system 100 shown in FIG. 1 may be used toimplement methods of the examples described herein. As described above,the graphics processing system 100 is a tile-based deferred renderinggraphics processing system which includes a GPU 102 and two portions ofmemory 104 ₁ and 104 ₂. As mentioned above, the two portions of memory104 ₁ and 104 ₂ may, or may not, be parts of the same physical memory,and both memories 104 ₁ and 104 ₂ may be situated “off-chip”, i.e. noton the same chip as the GPU 102. Communication between the memories (104₁ and 104 ₂) and the GPU 102 may take place over a communications bus inthe system 100. The GPU 102 comprises a pre-processing module 106, atiling unit 108 and a rendering unit 110. The tiling unit 108 comprisesprocessing logic 112 and a data store 114, and the rendering unit 110comprises a hidden surface removal (HSR) module 116 and atexturing/shading module 118.

In operation, the graphics processing system 100 receives graphics data(e.g. from an application) describing a sequence of primitives. Thepre-processing module 106 performs functions such as geometry processingincluding clipping and culling to remove primitives which do not fallinto a visible view. The pre-processing module 106 may also project theprimitives into screen-space. The pre-processing module 106 outputsprimitives to the tiling unit 108.

With reference to the flow chart shown in FIGS. 4a and 4b , an exampleof how the graphics processing system 100 can process primitives isdescribed. Rather than performing tiling calculations for each tile in abounding box for a primitive, tiling tests can be performed for a subsetof the tiles. Then the results of the tiling tests for the subset oftiles can be used to determine whether the primitive is in other tileswhich are located within a region bounded by two or more of the tiles ofthe subset. It is noted that the “other tiles” are not in the subset oftiles for which tiling tests are performed. In this way the tilingprocess can be implemented without performing tiling calculations forall of the tiles in the bounding box for a primitive. Reducing thenumber of tiling calculations can help to improve the efficiency of thegraphics processing system (in terms of speed and power consumption) forrendering a primitive.

In step S402, the tiling unit 108 receives primitives from thepre-processing module 106. The operation of the tiling unit 108 isdescribed in detail with reference to the flow chart shown in FIGS. 4aand 4b , but in summary the tiling unit 108 determines which of theprimitives are present within each of the tiles of the rendering spaceof the graphics processing system 100. The processing logic 112 of thetiling unit 108 performs the operations of the tiling unit 108 describedherein, and the data store 114 stores data of intermediate results ofthe tiling process, such as results of tiling calculations and partiallyfilled display lists. The processing logic 112 may be implemented indedicated hardware designed specifically for performing the operationsof the tiling unit 108. Alternatively, the processing logic 112 may beimplemented by executing software on a processor wherein the software iswritten such that when it is executed it causes the processor to performthe operations of the tiling unit 108.

The tiling unit 108 considers a first primitive. In step S404 a boundingbox is determined for the primitive. In the examples described in detailherein, the bounding boxes are axis-aligned bounding boxes, i.e. theyare aligned with the axes of the grid of tiles of the rendering space;but in other examples bounding boxes might not be axis aligned, i.e.they may be at an angle relative to the grid of tiles. If the primitiveextends beyond the edges of the rendering space then the bounding box isclipped so that it does not extend beyond the edges of the renderingspace. For example, the bounding box may be clipped so that it has anedge on the edge of the rendering space. The bounding box may bedetermined at the resolution of the tiles such that the edges of thebounding box are on tile boundaries (because in these examples, thebounding box is axis-aligned). If this is the case, the edges of thebounding box are extended outwards to the next tile boundary even if acloser tile boundary could be found by bringing the bounding box edgeinwards. In this way the bounding box is determined conservatively sothat it includes all of the tiles in which the primitive is located.Alternatively, the bounding box might be determined at a finerresolution than the tile resolution, for example, the bounding box 208shown in FIG. 2 is not at the tile resolution. In these examples, a tileis determined to be in the bounding box if it at least partiallyoverlaps with the bounding box.

In step S406, the tiling unit 108 determines whether the bounding boxextends over more than one tile in both x and y directions. If this isnot the case (i.e. if the bounding box extends over only one tile ineither or both of the x and y directions) then, unless it is anexception case (e.g. one of the exception cases described below), theprimitive will be in all of the tiles in the bounding box. For example,FIG. 5a shows a primitive 504 which lies in just one, single tile 502.There are other tiles in the rendering space which are not shown in FIG.5a , but the primitive 504 does not overlap those other tiles. In thiscase, the tile 502 is the only tile in the bounding box, so the boundingbox does not extend over more than one tile in either the x or the ydirection. It is apparent that the primitive 504 is in the tile 502 andnot in other tiles of the rendering space. Therefore, in this case, inorder to determine which tile(s) the primitive 504 is in, the tilingunit 108 does not need to perform any tiling calculations involvingfloating point operations to compare edge lines of the primitive 504with a test point in a tile. Therefore, the tiling process for primitive504 can be performed very efficiently.

Similarly, FIG. 5b shows a primitive 508 which lies in a row of tiles506 ₁, 506 ₂, 506 ₃ and 506 ₄. There are other tiles in the renderingspace which are not shown in FIG. 5b , but the primitive 508 does notoverlap those other tiles. The bounding box for primitive 508 extendsover four tiles in the x direction, but does not extend over more thanone tile in the y direction. In this case, the tiles 506 ₁, 506 ₂, 506 ₃and 506 ₄ are the only tiles in the bounding box, and it is apparentthat the primitive 508 is in the tiles 506 ₁, 506 ₂, 506 ₃ and 506 ₄ andnot in other tiles of the rendering space. Therefore, in this case, inorder to determine which tile(s) the primitive 508 is in, the tilingunit 108 does not need to perform any tiling calculations involvingfloating point operations to compare edge lines of the primitive 508with a test point in a tile. Therefore, the tiling process for primitive508 can be performed very efficiently.

If the bounding box for the primitive does not extend over more than onetile in both x and y directions the method passes from step S406 to stepS408 in which it is determined whether the bounding box is an exceptioncase. The examples shown in FIGS. 5a and 5b are not exception cases. Anexception case occurs when:

-   -   (i) the bounding box for a primitive has been clipped to the        edge of the rendering space, and the clipped edge of the        bounding box extends over more than one tile; or    -   (ii) the bounding box for a primitive has been clipped in two        directions.

FIG. 5c shows three primitives, denoted 510, 514 and 518 within arendering space which includes 21 tiles arranged in a 3×7 arrangementand labelled 0 to 20 in FIG. 5c . Primitive 510 has a bounding box 512which has been clipped to the edge of the rendering space, and thebounding box 512 extends over parts of tiles 0, 1, 2, 3, 4 and 5.Therefore the bounding box 512 does not extend over more than one tilein the y direction (vertical direction), but the clipped edge of thebounding box 512 (the top edge of the bounding box 512) does extend overmore than one tile in the x direction (horizontal direction), so thebounding box 512 is an exception case. It can be seen that the primitive510 is not in all of the tiles in the bounding box 512. In thisexception case, tiling calculations are to be performed on the tiles inthe bounding box 512 in order to determine which tiles of the boundingbox 512 the primitive 510 is in. Therefore, in exception cases such asthis, the method passes from step S408 to step S412 which is describedin more detail below.

As another example, primitive 514 has a bounding box 516 which has beenclipped to the edge of the rendering space, and the bounding box 516extends over parts of tiles 8 and 15. Therefore the bounding box 516does not extend over more than one tile in the x direction, and inparticular the clipped edge of the bounding box 516 (the bottom edge ofthe bounding box 516) does not extend over more than one tile (theclipped edge is only in tile 15). Furthermore, the bounding box 516 isnot clipped in two directions. Therefore, the bounding box 516 is not anexception case according to the rules given above. It can be seen thatthe primitive 514 is in all of the tiles in the bounding box 516.Therefore, tiling calculations do not need to be performed on the tilesin the bounding box 516 in order to determine which tiles of thebounding box 516 the primitive 514 is in. Therefore, in non-exceptionalcases such as this, the method passes from step S408 to step S410 whichis described in more detail below. It is noted that bounding boxes whichare not clipped (as in the examples described above with reference toFIGS. 5a and 5b ) are not exceptional cases so in those cases themethods passes from step S408 to step S410.

As a further example, primitive 518 has a bounding box 520 which hasbeen clipped in two directions. Therefore the bounding box 520 is anexception case according to the rules given above. It can be seen thatthe primitive 518 is not in the tile of the bounding box 520. Since thisis an exception case, tiling calculations are to be performed on thetile in the bounding box 520 (tile 20) in order to determine whether theprimitive 518 is in the tile (tile 20) of the bounding box 520.Therefore, in this case, the method passes from step S408 to step S412.

It is noted that in some examples the detection and handling ofexception cases may be optional. An efficiency loss may be incurred ifexceptional primitives (e.g. primitives 510, 514 or 518) are not treatedseparately, because the exceptional primitives may then be added to thedisplay lists of more tiles than necessary. However, this does not leadto a rendering error, so it may be acceptable. If the exception casesare not handled separately, the processing involved in step S408 can beavoided, at the expense of including some exceptional primitives in moredisplay lists than is strictly necessary.

For each tile in the rendering space, the tiling unit 108 creates adisplay list, which may be stored, e.g. in the store 114, while thetiling unit 108 is processing the primitives. The display list for atile includes primitive identifiers which indicate which of theprimitives are in that tile. In step S410, for non-exceptional cases,the tiling unit 108 adds a primitive identifier of the primitivecurrently being processed to the display list(s) for the respectivetile(s) in the bounding box. For example, in the example shown in FIG.5a , the primitive identifier for primitive 504 would be added to thedisplay list for tile 502 but not to display lists for other tiles inthe rendering space. Similarly, in the example shown in FIG. 5b , theprimitive identifier for primitive 508 would be added to the displaylists for tiles 506 ₁, 506 ₂, 506 ₃ and 506 ₄ but not to display listsfor other tiles in the rendering space. Similarly, in the example shownin FIG. 5c , the primitive identifier for primitive 514 would be addedto the display list for tiles 8 and 15 but not to display lists for theother tiles in the rendering space. In this way a primitive can be tiledvery efficiently without performing the tiling calculations on the edgeequations as mentioned above. It is noted that in some tests, it wasfound that over 70% of primitives in an average scene can be tiled inthis way without performing the tiling calculations on the edgeequations. The method passes from step S410 to step S430, which isdescribed below.

If it is determined in step S406 that the bounding box does extend overmore than one tile in both the x and y directions then the method passesfrom step S406 to step S412. In step S412 the tiling unit 108 identifiestiles in which the vertices of the primitive are located, therebydetermining that the primitive is in the identified tiles. It is notedthat more than one of the vertices of the primitive may be in the sametile. It is simple to identify the tiles in which the vertices arelocated because the vertex locations have already been used to determinethe bounding box. Step S412 can be performed efficiently (in terms oftime and power consumption), without performing further tiling tests fordetermining whether the primitive is in the identified tiles. Forexample, FIG. 6 shows a primitive 604, wherein the bounding box of theprimitive 604 includes a 2×2 group of tiles denoted 602 ₁₁, 602 ₁₂, 602₂₁ and 602 ₂₂. The tiles shown with hatching in FIG. 6 (tiles 602 ₁₂,602 ₂₁ and 602 ₂₂) are identified in step S412 because they each includea vertex of the primitive 604. Therefore the tiling unit 108 can easilydetermine that the primitive is in the hatched tiles, e.g. withoutperforming tiling calculations on the edge equations for the primitive604.

In step S414 the primitive identifier is added to the display lists forthe identified tiles.

In step S416 the tiling unit 108 determines whether there are more tilesin the bounding box to be processed. A tile is still to be processed ifit has not yet been determined whether the primitive is in the tile. Forexample, if all of the tiles of the bounding box include a vertex of theprimitive then it is already determined that the primitive is in all ofthe tiles of the bounding box, so there are no more tiles in thebounding box to be processed. In this case, the method passes from stepS416 to step S430. However, if there are more tiles in the bounding boxto be processed (i.e. more tiles for which it is not yet determinedwhether the primitive is in the tile) then the method passes to stepS418. For example, with reference to FIG. 6, it is still not determinedwhether the primitive 604 is in the tile 602 ₁₁, so the method passes tostep S418.

In step S418, for each tile of at least a subset of the tiles, if it hasnot already been determined, the tiling unit 108 determines whether theprimitive is in that tile. For example, where the bounding box includesmore than four tiles, the subset of tiles may include the corner tileswhich are in the corners of the bounding box. An example of this isshown in FIG. 7a which shows a primitive 704 with a bounding boxincluding a 2×8 array of tiles 702. The corner tiles are shown withhatching in FIG. 7a , and are denoted 702 ₁₁, 702 ₁₈, 702 ₂₁ and 702 ₂₈.

A vertex of the primitive 704 is in tile 702 ₁₁, and another vertex ofthe primitive 704 is in tile 702 ₂₈, so the tiling unit 108 has alreadydetermined that the primitive 704 is in corner tiles 702 ₁₁ and 702 ₂₈.In step S418 the tiling unit 108 determines whether the primitive 704 isin tiles 702 ₁₈ and 702 ₂₁ by performing tiling calculations. In orderto perform the tiling calculations on the primitive for a tile, for eachedge of the primitive, an edge equation describing the edge of theprimitive is used to determine whether an edge-specific test point inthe tile is inside or outside of the edge. The primitive is determinedto be outside of the tile if it is determined, for any of the edges,that the respective edge-specific test point is outside of the edge. Thetest point of the tile is different depending on the orientation of theedge which it is tested against because a primitive should be determinedto be in a tile if any part of the primitive is inside any part of thetile. Therefore, the edge-specific test point in a tile for an edge isthe point in the tile which is the most likely to be inside the edge inaccordance with the orientation of the edge. For example, FIG. 8 showsthe test point which is used for different edge orientations. Row (a) ofFIG. 8 shows that for an upward sloping edge wherein points outside ofthe edge are below and/or to the right of the edge, the edge specifictest point 804 is in the top left corner of a tile 802 (e.g. the topleft sample position within the tile 802). It can be appreciated that ifthe test point 804 is outside of the edge then so are all of the otherpoints in the tile 802. Similarly, row (b) of FIG. 8 shows that for anupward sloping edge wherein points outside of the edge are above and/orto the left of the edge, the edge specific test point 808 is in thebottom right corner of a tile 806 (e.g. the bottom right sample positionwithin the tile 806). It can be appreciated that if the test point 808is outside of the edge then so are all of the other points in the tile806. Similarly, row (c) of FIG. 8 shows that for a downward sloping edgewherein points outside of the edge are below and/or to the left of theedge, the edge specific test point 812 is in the top right corner of atile 810 (e.g. the top right sample position within the tile 810). Itcan be appreciated that if the test point 812 is outside of the edgethen so are all of the other points in the tile 810. Similarly, row (d)of FIG. 8 shows that for a downward sloping edge wherein points outsideof the edge are above and/or to the right of the edge, the edge specifictest point 816 is in the bottom left corner of a tile 814 (e.g. thebottom left sample position within the tile 814). It can be appreciatedthat if the test point 816 is outside of the edge then so are all of theother points in the tile 814.

Therefore, referring to FIG. 7a again, for each tile in the subset (e.g.the corner tiles 702 ₁₁, 702 ₁₈, 702 ₂₁ and 702 ₂₈) a tiling test hasbeen performed to determine whether the primitive 704 is in therespective tile. As described above, the tiling test may comprisedetermining that the primitive 704 has one or more vertices in the tile,or the tiling test may comprise performing tiling calculations todetermine whether the primitive is in the tile. If the primitive is in atile then the primitive identifier is added to the appropriate displaylist for the tile.

In step S420 the tiling unit 108 determines whether there are more tilesin the bounding box to be processed. A tile is still to be processed ifit has not yet been determined whether the primitive is in the tile. Ifthere are no more tiles in the bounding box to be processed, the methodpasses from step S420 to step S430. However, if there are more tiles inthe bounding box to be processed (i.e. more tiles for which it is notyet determined whether the primitive is in the tile) then the methodpasses to step S422. For example, with reference to FIG. 7a , it isstill not determined whether the primitive 704 is in the non-cornertiles which do not include a vertex of the primitive 704, so the methodpasses to step S422.

In step S422 the tiling unit 108 analyses the subset of tiles for whicha tiling test has been performed. This analysis is performed todetermine whether the results of tiling at least one other tile in thebounding box can be inferred from the results of the tiling tests fortwo or more of the subset of tiles, without needing to perform a tilingtest for said at least one other tile. In examples described herein, theprimitives are known to be convex, such that the results of tiling atleast one tile in the bounding box can be correctly inferred from theresults of the tiling tests for two or more of the subset of tiles. Insome examples, all primitives may be known to be convex (e.g. allprimitives may be triangles), but in some other examples, incomingprimitives might not necessarily be strictly convex, and in theseexamples the methods may involve determining whether a primitive isconvex, wherein if the primitive is convex then methods may be performedas described herein to infer tiling results for tiles based on tilingresults for two or more of a subset of tiles; whereas if the primitiveis not convex then other methods may be used for performing tiling onthe primitive.

In step S424, if the analysis indicates that it is possible, the resultsof the tiling tests for two or more of the tiles of the subset are usedto determine whether the primitive is in the at least one other tile.The at least one other tile is not in the subset of tiles for whichtiling tests are performed. In particular, the at least one other tileis located within a region bounded by the two or more of the tiles ofthe subset. If a particular tile is surrounded by tiles from the subsetwhich all have the same tiling test results then it can be inferred thatthe particular tile will also have the same results. The tile may be“surrounded” in one dimension, i.e. the tile may be located between twotiles of the subset in a row or column of tiles. That is, two tiles ofthe subset in the same row or column of tiles may be used to infer thetiling results for tiles in that same row or column of tiles between(i.e. in a region bounded by) the two tiles of the subset. Furthermore,the tile may be “surrounded” in two dimensions, i.e. the tile may belocated in a region bounded by four tiles of the subset. That is, fourtiles arranged in a rectangle within the rendering space may be used toinfer the tiling results for tiles in the region bounded by those fourtiles, i.e. in a rectangle having those four tiles in the corners. It isnoted that the term “rectangle” includes “square”.

It is noted that, while a tile being surrounded by tiles that include aprimitive allows it to be inferred that that tile also includes theprimitive, it is not inferred that a tile does not include the primitivebased solely on a determination that the tile is surrounded by tilesthat do not include the primitive. However, when two or more tiles donot include a primitive because they are both outside the same edge ofthe primitive, then it may be inferred that any tiles which theysurround are also outside that edge, and are therefore also outside theprimitive. Therefore, per-edge results may be determined for the tilesof the subset which do not include the primitive. In this way, when atile is surrounded by two or more tiles of the subset which do notinclude the primitive, it can be checked that those surrounding tilesare outside of the same edge of the primitive, and in that case it isinferred that the surrounded tile is also outside of the primitive.However, if the surrounding tiles are outside of different edges of theprimitive then it is not inferred that the surrounded tile is alsooutside of the primitive. It is noted that when inferring that a tileincludes the primitive, the problem is simplified by the fact that toinclude a primitive, a tile is determined to be inside all of the edges.Therefore, there is no need to use per-edge results for inferring that atile includes a primitive based on determining that surrounding tiles ofthe subset include the primitive.

If the subset of tiles includes the corner tiles of the bounding box (asin FIG. 7a ) then if the results of the tiling tests for the subset oftiles indicate that the primitive is in all of the corner tiles of thebounding box (as in FIG. 7a ) then those results are used to determinethat the primitive (e.g. 704 in FIG. 7a ) is in all of the tiles of thebounding box. In this way, in the example shown in FIG. 7a , the resultsof the tiling tests for twelve of the tiles can be inferred withoutneeding to perform tiling tests specifically for each of those tiles.

FIG. 7b shows a rendering space including 32 tiles arranged in a 4×8grid. A large primitive 708 is in all of the tiles 706 of the renderingspace. The bounding box for the primitive 708 will be clipped to theedges of the rendering space. In this example, the tiling unitdetermines whether the primitive 708 is in the corner tiles 706 ₁₁, 706₁₈, 706 ₄₁ and 706 ₄₈ which are shown with hatching in FIG. 7b . Thesefour tiles make up the subset of tiles in this example. The tiling testfor tile 706 ₁₁ involves determining that a vertex of the primitive 708is in the tile 706 ₁₁, whereas the tiling tests for tiles 706 ₁₈, 706 ₄₁and 706 ₄₈ involve performing tiling calculations based on the edgeequations of the primitive 708 as described above to determine whetherthe primitive 708 is in the respective tile 706. By analysing theresults of the tiling tests for the four corner tiles, the tiling unit108 can determine in this example that, since the primitive is in thefour corner tiles, then the primitive is also in all of the other tilesin the rendering space, without needing to perform tiling calculationsfor the respective other tiles of the rendering space. As describedabove, if the primitive is determined to be in a tile then the primitiveidentifier is added to the display list for the respective tile.

The method continues to step S426 in which the tiling unit 108determines whether there are more tiles in the bounding box to beprocessed. A tile is still to be processed if it has not yet beendetermined whether the primitive is in the tile. If there are no moretiles in the bounding box to be processed (as is the case in theexamples shown in FIGS. 7a and 7b ), the method passes from step S426 tostep S430. However, if there are more tiles in the bounding box to beprocessed (i.e. more tiles for which it is not yet determined whetherthe primitive is in the tile) then the method passes to step S428. Instep S428, for each remaining tile (i.e. for each tile for which it isnot yet determined whether the primitive is in the tile) tilingcalculations are performed to determine whether the primitive is in thetile, and if so, the primitive identifier is added to the display listfor the tile. As described above, the tiling calculations for aparticular tile include comparing the line equations for the edges ofthe primitive with edge-specific test points of the particular tile.Therefore, following step S428 it has been determined for all of thetiles in the rendering space whether the primitive is in the tile, andthe primitive identifier has been added to the display lists for therespective tiles accordingly. The method then passes to step S430.

In step S430 the tiling unit 108 determines whether there are moreprimitives to tile in the current render. Each render will likelyinclude many primitives (e.g. thousands or millions of primitives). Therender may for example be performed to generate an image from a 3dimensional model to be displayed on screen or to be used as a texturein other renders. If there are more primitives to tile then the methodpasses back to step S404 and repeats for the next primitive. Once all ofthe primitives in the current render have been tiled then the methodwill pass from step S430 to step S432 in which the display lists for thetiles are output from the tiling unit 108 and stored in the memory 104₁. As described above, in examples described herein, whilst the displaylists are being created they may be stored in the store 114 which isinternal to the tiling unit 108. In some examples, once all of theprimitives for a render have been tiled then the display lists arecomplete and they are passed to the off-chip memory 104 ₁ for storagetherein. In other examples, the tiling unit 108 might not include aninternal store (such as store 114) for use in storing display lists, andinstead primitive identifiers may be written directly to display listsin memory 104 ₁ as tiling is performed. In some further examples, theinternal store 114 may be implemented in the tiling unit 108, but theinternal store 114 might not be big enough to store all of the displaylists for all of the tiles at once. Therefore, the internal store 114may be used to gather tiling results that can then be written out tomemory 104 ₁ in chunks (or “batches”) as the tiling is performed. Thiscan avoid inefficient memory access patterns when primitives are writtento different display lists in memory 104 ₁.

The rendering unit 110 can then render the primitives in each of thetiles in accordance with the display lists. In order to render theprimitives for a tile, in step S434 the rendering unit 110 retrieves theappropriate display list from the memory 104 ₁ for the tile. Therendering unit 110 can then retrieve the primitives indicated by thedisplay list as being in the tile currently being rendered. Theseprimitives may be retrieved from the memory 104 ₁. The rendering unit110 then renders the primitives in the tile. In the example shown inFIG. 1, the rendering unit 110 implements deferred rendering wherebyhidden surface removal is performed before texturing and/or shading.Therefore, the HSR module 116 performs hidden surface removal to therebyremove fragments of primitives which are hidden in the scene. Theremaining fragments are passed to the texturing/shading module 118 whichperforms texturing and/or shading on the fragments to determine arendered result, e.g. to determine pixel colour values of a renderedimage. In step S436 the rendered result is output and can be passed tothe memory 104 ₂, e.g. for storage in a frame buffer. The rendering unit110 processes primitives in each of the tiles and when the whole imagehas been rendered and stored in the memory 104 ₂, the image can beoutputted from the graphics processing system 100 and, for example,displayed on a display. It is noted that in other examples, therendering unit might be a non-deferred rendering unit whereby texturingand/or shading can be performed on primitives before hidden surfaceremoval.

In the examples described above it can be seen that by performing tilingtests to determine whether a primitive is in a subset of the tiles, theresults of those tiling tests can be used to determine whether theprimitive is in other tiles which are located within a region bounded bysome of the tiles of the subset. The examples shown in FIGS. 7a and 7bshow the subset of tiles being the corner tiles of the bounding box. Inother examples the subset of tiles may be different tiles within thebounding box. For example, there may be a regular spacing between thetiles of the subset of tiles. For example, the subset of tiles mayinclude a respective tile from each of a plurality of N×M blocks oftiles of the rendering space, where N and M are integers. FIG. 9 showsan example in which N=M=2. That is, in FIG. 9, tiling tests areperformed on a 2×2 tile grid such that one tile from each 2×2 block oftiles is in the subset of tiles for which a tiling test is performed.

FIG. 9 shows a primitive 904, wherein a 9×14 group of tiles are in thebounding box of the primitive 904. Row numbers (1 to 9) and columnnumbers (1 to 14) are shown in FIG. 9. The location of the vertices ofthe primitive 904 are used to determine that the vertices of primitive904 are in the fourteenth tile of the first row (tile T_(1,14)), in thefourth tile of the second row (tile T_(2,4)), and in the first tile ofthe ninth row (tile T_(9,1)) (in step S412). These three tiles are shownwith downward sloping hatching in FIG. 9. Tiling calculations involvingcomparing edge equations to test points do not need to be performed forthese three tiles.

In FIG. 9, the tiles of the subset of tiles are shown with upwardsloping hatching (except for the first tile of the ninth row (tileT_(9,1)) which is in the subset but which has downward sloping hatchingbecause a vertex is located in that tile), including as an example tile902 ₁₁ (tile T_(1,1)). The tiles of the subset include the first, third,fifth, seventh, ninth, eleventh and thirteenth tiles from the first,third, fifth, seventh and ninth rows of tiles in the bounding box. Itcan be appreciated that due to the location of the vertices of theprimitive 904, the tiling unit 108 has determined that the primitive isin the first tile of the ninth row (tile T_(9,1)). For the other tilesof the subset, tiling calculations are performed (in step S418) todetermine whether the primitive 904 is in the tiles. These tilingcalculations are performed as described above by comparing edgeequations of the primitive 904 to test points in the tiles. Results ofthe tiling tests performed on the subset of tiles are shown in FIG. 9 byindicating for each tile of the subset whether the primitive 904 is “in”the tile or “out” of the tile.

The results of the tiling tests (including the per-edge results, whichas described above are for use in inferring whether tiles do not includethe primitive) for the subset of tiles can then be analysed (in stepS422) to determine whether there are 3×3 blocks of tiles which havetiles from the subset of tiles in the corners, wherein those tiles ofthe subset have the same tiling test results. If this is the case thenthe remaining five tiles in the 3×3 block can be assigned the sameresults as the relevant tiles of the subset (in step S424), withoutperforming specific tiling calculations for those five tiles. Forexample, the 3×3 block of tiles shown in FIG. 9 in the top left cornerof the bounding box (i.e. the first three tiles in the first three rowsof the bounding box) includes tiles of the subset (tiles T_(1,1),T_(1,3), T_(3,1) and T_(3,3)) in the four corners for which the tilingtest results indicate that the primitive 904 is outside those tiles andin particular, that the primitive 904 is outside those tiles because thetiles are all outside the same edge of the primitive 904 (e.g. outsidethe left edge of the primitive 904 as shown in FIG. 9). Therefore, itcan be inferred from the tiling results for the subset of tiles that theprimitive 904 is outside of the other five tiles in that 3×3 block(tiles T_(1,2), T_(2,1), T_(2,2), T_(2,3) and T_(3,2)), which are in theregion bounded by the four tiles of the subset, without performing anyfurther tiling tests for those five tiles. Similarly, the 3×3 block oftiles shown in FIG. 9 in the fifth to seventh rows and the third tofifth columns of the bounding box includes tiles of the subset (tilesT_(5,3), T_(5,5), T_(7,3) and T_(7,5)) in the four corners for which thetiling test results indicate that the primitive 904 is inside thosetiles. Therefore, it can be inferred from the tiling results for thesubset of tiles that the primitive 904 is in the other five tiles inthat 3×3 block (tiles T_(5,4), T_(6,3), T_(6,4), T_(6,5) and T_(7,4)),which are in the region bounded by the four tiles of the subset, withoutperforming any further tiling tests for those five tiles.

Similarly, the results of the tiling tests for the subset of tiles canbe analysed (in step S422) to determine whether there are two tiles ofthe subset in a line (e.g. in the same row or column) which have thesame tiling test results. If this is the case then the other tile(s)between those two tiles of the subset can be assigned the same resultsas the relevant tiles of the subset (in step S424), without performingspecific tiling calculations for those other tile(s). For example, thetiling tests for the first tile in the third and fifth rows of thebounding box (tiles T_(3,1) and T_(5,1)) indicate that the primitive 904is outside those tiles, and that the tiles T_(3,1) and T_(5,1) areoutside of the same edge of the primitive 904. Therefore, it can beinferred from the tiling results for the subset of tiles that theprimitive 904 is outside of the first tile in the fourth row (tileT_(4,1)) (which is in the region bounded by the two tiles of the subset(tiles T_(3,1) and T_(5,1))) without performing a further tiling testfor that tile. Similarly, the tiling tests for the seventh and ninthtiles in the third row of the bounding box (tiles T_(3,7) and T_(3,9))indicate that the primitive 904 is inside those tiles. Therefore, it canbe inferred from the tiling results for the subset of tiles that theprimitive 904 is in the eighth tile in the third row (tile T_(3,8))(which is in the region bounded by the two tiles of the subset (tilesT_(3,7) and T_(3,9))) without performing a further tiling test for thattile.

In some examples, steps S422 and S424 may be repeated so that furtheranalysis of the tiling results may be implemented, e.g. based on thetiles in which the vertices of the primitive are located. This may allowthe tiling results of further tiles to be inferred without performingspecific tiling calculations for those further tiles based oncomparisons involving edge equations. For example, after the firstanalysis of the tiling tests for the subset of tiles, it has beeninferred that the primitive 904 is inside the eleventh tile in thesecond row of the bounding box (tile T_(2,11)) shown in FIG. 9. It isalso known that the primitive 904 is in the fourth tile in the secondrow of the bounding box (tile T_(2,4)) due to the location of one of thevertices of the primitive 904. Therefore, in a further analysis stage itcan be inferred that the primitive 904 is in the fifth to tenth tiles inthe second row of the bounding box (tiles T_(2,5) to T_(2,10)) withoutperforming tiling calculations for those tiles. Similarly in a furtheranalysis stage it can be inferred that the primitive 904 is in the thirdand the fourth tiles in the fourth column of the bounding box (tilesT_(3,4) and T_(4,4)) without performing tiling calculations for thosetiles.

Tiles for which the tiling results are inferred from tiling results oftiles of the subset are shown in FIG. 9 with dotted shading. Thelightest dotted shading indicates that the primitive 904 is outside ofthe tiles, whereas the two types of darker dotted shading indicate thatthe primitive 904 is inside the tiles. The lighter of the two darkerdotted shading indicates that the primitive 904 is determined to beinside the tile after the first analysis, and the darker of the twodarker dotted shading indicates that the primitive 904 is determined tobe inside the tile after a further analysis.

As described above, it is noted that when the results of the tilingtests are analysed, if the tiling tests indicate that the primitive isoutside of a group of tiles of the subset, then the reason for theprimitive being outside of the tile should be taken into account, i.e.which edge of the primitive is the tile outside. For the results of aplurality of tiles of the subset to be used to infer that the primitiveis outside of another tile then all of the plurality of tiles of thesubset should be outside of the same edge of the primitive, otherwise itcould be erroneously inferred that the primitive is outside of the othertile.

In step S428, tiling calculations are performed using edge equations andtest points within tiles, for the remaining tiles in FIG. 9 (i.e. thosetiles which have no shading or hatching), such that the tiling of theprimitive 904 is complete. In the example shown in FIG. 9, the boundingbox includes 126 tiles. Tiling calculations based on edge equations areperformed for 68 of the tiles; the tiling test for 3 of the tilesinvolves identifying which tiles the vertices of the primitive 904 arein; and for the other 55 tiles, the determination as to whether theprimitive 904 is in the tiles is inferred from the results of the tilingtests for other tiles in the bounding box. In the previous systemsdescribed in the background section above, the tiling calculations wouldbe performed for each of the tiles in the bounding box, i.e. for 126tiles in the example shown in FIG. 9. Therefore, in this example, themethod described herein avoids performing the tiling calculations for 58of the tiles (46% of the tiles). Since the tiling calculations involvefloating points operations and take significant processing resources andtime to implement, the reduction in the number of tiles for which tilingcalculations are performed will significantly improve the efficiency (interms of speed and power consumption) of the tiling process in thisexample.

The number of tiles included in the subset could be varied. Inparticular, the tiling of the primitive could be implemented in ahierarchical manner such that, in a first (coarse) stage the tilingtests are performed for a subset of tiles and the results of the tilingtests are used to determine whether the primitive is in at least oneother tile at a relatively coarse resolution with the subset of tilesincluding a respective tile from each of a plurality of N₁×M₁ blocks oftiles of the rendering space. Then in a second (fine) stage the tilingtests are performed for a subset of tiles and the results of the tilingtests are used to determine whether the primitive is in at least oneother tile at a relatively fine resolution with the subset of tilesincluding a respective tile from each of a plurality of N₂×M₂ blocks oftiles of the rendering space, wherein N₁>N₂ and/or M₁>M₂. For example,in the first stage N₁ and M₁ may equal 4 such that the subset of tilesincludes a respective tile from each of a plurality of 4×4 blocks oftiles of the rendering space, then in the second stage N₂ and M₂ mayequal 2 such that the subset of tiles includes a respective tile fromeach of a plurality of 2×2 blocks of tiles of the rendering space. Inthis way, if possible, in the first stage the tiling results can beinferred for large areas of the bounding box if all the tiles in thoseareas have the same tiling results without performing many tilingcalculations, then in the second stage the tiling results can beinferred for remaining smaller areas of the bounding box if all thetiles in those areas have the same tiling results. In another example,in the first stage, only the corner tiles of the bounding box may beincluded in the subset of tiles, then in the second stage, a respectivetile from each of a plurality of N₂×M₂ blocks of tiles may be includedin the subset of tiles. Furthermore, in other examples, more than twostages may be implemented at different resolutions, i.e. there may bemore than two stages in the hierarchy.

With reference to FIGS. 10 and 11 a to 11 d, another way of tiling aprimitive is described, which can be implemented by the tiling unit 108in addition to, or as an alternative to, the tiling methods describedabove.

With reference to the flow chart shown in FIG. 10, in step S1002, thetiling unit 108 receives primitives from the pre-processing module 106.The tiling unit 108 considers a first primitive. In step S1004 abounding box is determined for the primitive, e.g. in the same manner asdescribed above, and if the primitive extends beyond the edges of therendering space then the bounding box is clipped so that it does notextend beyond the edges of the rendering space. As described above, atile is determined to be in the bounding box if it at least partiallyoverlaps with the bounding box. A primitive is determined to not be intiles which do not at least partially overlap with the bounding box.

In the method described with reference to FIGS. 10 and 11 a to 11 d,lines of tiles in the bounding box are processed at a time, wherein thelines may be rows or columns. It can be beneficial to set the lines tobe rows if there are more columns of tiles than rows of tiles in thebounding box; whereas it can be beneficial to set the lines to becolumns if there are more rows of tiles than columns of tiles in thebounding box. Therefore, the lines of tiles are chosen to be in thedimension having the lowest number of lines of tiles in the boundingbox. This is beneficial because the number of calculations that areperformed for tiling a primitive scales linearly with the number oflines in the bounding box, so choosing the dimensionality of the linesto be a minimum may reduce the amount of processing involved in tilingthe primitive. In step S1006 the tiling unit 108 determines whetherthere are more columns of tiles than rows of tiles in the bounding box.If there are more columns of tiles than rows of tiles in the boundingbox then in step S1008 the tiling unit 108 determines that the boundingbox is to be processed in rows of tiles. Alternatively, if there are notmore columns of tiles than rows of tiles in the bounding box then instep S1010 the tiling unit 108 determines that the bounding box is to beprocessed in columns of tiles.

As a broad overview of the method described in detail with reference tothe flow chart shown in FIG. 10, for each of one or more tile boundariesbetween lines of tiles in the bounding box, the tiling unit 108determines intersection points of the tile boundary with edges of theprimitive, and uses the determined intersection points to determinewhich of the tiles in the bounding box the primitive is in.

FIGS. 11a to 11d show an example of a primitive 1102 with a bounding boxwhich includes a 6×4 group of tiles. In this example there are more rowsof tiles than columns of tiles in the bounding box, so in step S1010 thetiling unit 108 determines that the bounding box is to be processed incolumns of tiles. In the example described below the bounding box isprocessed in columns of tiles, but it should be appreciated that inother examples the bounding box may be processed in rows of tiles, ifthat is appropriate.

A first column of tiles in the bounding box is considered, wherein thetile boundary 1104 between the first and second columns of tiles isconsidered. In step S1012, for the first column of tiles in the boundingbox, the tiling unit determines initial intersection points of the tileboundary 1104 with edge lines defining edges of the primitive 1102. Twoof the edges of the primitive 1102 cross the tile boundary 1104, whereasfor the other edge of the primitive, the edge line 1106 which definesthe edge intersects with the tile boundary 1104 at a position which isoutside of the primitive 1102. The initial intersection points are shownin FIG. 11a at points 1108 ₁, 1108 ₂ and 1108 ₃. Unless one of the edgesof the primitive 1102 is parallel to the tile boundary 1104 then therewill be three initial intersection points 1108, two of which (1108 ₂ and1108 ₃ in the example shown in FIG. 11a ) will lie on the edge of theprimitive 1102 and are useful for determining which of the tiles theprimitive 1102 is in, whilst the other intersection point (1108 ₁) willnot lie on the edge of the primitive 1102 and will not be useful fordetermining which of the tiles the primitive 1102 is in.

In step S1014 the tiling unit 108 determines which of the initialintersection points are to be used as intersection points of the tileboundary 1104 with the edge of the primitive 1102 by identifying whichof the initial intersection points lie on the edge of the primitive1102. This can be done by considering progressing along the tileboundary 1104 and for points either side of an initial intersectionpoint (e.g. immediately either side of the initial intersection point)determining whether the points are inside or outside of the primitive1102. If the determination is different for the two points either sideof an initial intersection point then the initial intersection point isan intersection point on the edge of the primitive (e.g. points 1108 ₂and 1108 ₃), whereas if the determination is the same for the two pointseither side of an initial intersection point then the initialintersection point is not an intersection point on the edge of theprimitive (e.g. point 1108 ₁). Therefore in the example shown in FIG.11a intersection points 1108 ₂ and 1108 ₃ are identified as being on theedge of the primitive 1102, and these identified intersection points areused to determine which of the tiles in the first column of the boundingbox the primitive is in. The identified intersection points can bestored in the store 114 for use in a subsequent iteration to process asubsequent column, as is apparent in the description provided below. Itcould be the sample position of the intersection point which is storedor simply the tile in which the intersection point occurs. The methodthen passes from step S1014 to both steps S1016 and S1018.

In step S1016 the tiling unit 108 determines a start tile 1112 _(s) inthe column of tiles. This is done by finding the first tile in thecolumn (e.g. starting from the top of the bounding box and workingdownwards) which includes one of the determined intersection pointsidentified in step S1014 (either 1108 ₂ or 1108 ₃) on its boundary orwhich includes a vertex of the primitive 1102. Tile 1112 _(s) isdetermined to be the start tile because it has the intersection point1108 ₂ on its boundary. In step S1018 the tiling unit 108 determines anend tile 1112 _(e) in the column of tiles. This is done by finding thelast tile in the column (e.g. starting from the top of the bounding boxand working downwards) which includes one of the determined intersectionpoints identified in step S1014 (either 1108 ₂ or 1108 ₃) on itsboundary or which includes a vertex of the primitive 1102. Tile 1112_(e) is determined to be the end tile because it has the intersectionpoint 1108 ₃ on its boundary and it also has the vertex 1110.

In step S1020 the tiling unit 108 determines that the primitive is inthe tiles in the column between, and including, the start tile 1112 _(s)and the end tile 1112 _(e). These tiles of the first column between andincluding the start and end tiles (1112 _(s) and 1112 _(e)) are shownwith hatching, and it can be seen that the primitive 1102 is in thehatched tiles but not in the other tiles of the first column of thebounding box.

In step 1022, the primitive identifier for primitive 1102 is added tothe display lists for those tiles for which it is determined that theprimitive is in those tiles (e.g. the hatched tiles shown in FIG. 11a ).

In step S1024 the tiling unit 108 determines whether there are morelines (columns in this example) of tiles to process in the bounding box.If there are, then the method passes to step S1026 so that the next line(e.g. column) can be processed. In step S1026 the tiling unit 108determines whether the next line is the last line of the bounding box.If the next line is not the last line in the bounding box then themethod passes from step S1026 to step S1012 so that the next line can beprocessed.

For example, in the example shown in FIG. 11b , the second column oftiles can be processed. In this way, the tile boundary 1114 between thesecond and third columns of tiles is used to determine the initialintersection points 1118 ₁, 1118 ₂ and 1118 ₃ (in step S1012). Theinitial intersection point 1118 ₁ is at the point where the edge line1116 crosses the tile boundary 1114, but this initial intersection point1118 ₁ is not on the edge of the primitive 1102. However, the otherinitial intersection points 1118 ₂ and 1118 ₃ are on the edge of theprimitive 1102, so in step S1014 the initial intersection points 1118 ₂and 1118 ₃ (but not 1118₁) are identified as being intersection pointswhich lie on the edge of the primitive. These identified intersectionpoints can be stored for use in a subsequent iteration.

To find the start and end tiles of the second column, the locations ofthe intersection points 1108 ₂ and 1108 ₃ (which were determined in theprevious iteration and stored for use in this iteration), the locationsof the intersection points 1118 ₂ and 1118 ₃ and the location of thevertex 1020 are used. The start tile is determined to be tile 1122 _(s)(in step S1016) because this tile includes the vertex 1120. The end tileis determined to be tile 1122 _(e) (in step S1018) because this tileincludes the intersection points 1108 ₃ and 1118 ₃. The tiles shown withhatching in FIG. 11b are determined to be in the primitive 1102 in stepS1020 because they are between (and including) the start and end tiles1122 _(s) and 1122 _(e). Therefore the primitive identifier forprimitive 1102 is added to the display lists for the tiles shown withhatching in FIG. 11b (in step S1022).

The method repeats for the next column (the third column), as shown inFIG. 11c . Since the third column is not the last column in the boundingbox the method repeats back to step S1012 and the third column isprocessed. In this way, the tile boundary 1124 between the third andfourth columns of tiles is used to determine the initial intersectionpoints 1128 ₁, 1128 ₂ and 1128 ₃ (in step S1012). The initialintersection point 1128 ₁ is at the point where the edge line 1126crosses the tile boundary 1124, but this initial intersection point 1128₁ is not on the edge of the primitive 1102. However, the other initialintersection points 1128 ₂ and 1128 ₃ are on the edge of the primitive1102, so in step S1014 the initial intersection points 1128 ₂ and 1128 ₃(but not 1128₁) are identified as being intersection points which lie onthe edge of the primitive. These identified intersection points can bestored for use in a subsequent iteration.

To find the start and end tiles of the third column, the locations ofthe intersection points 1118 ₂ and 1118 ₃ (which were determined in theprevious iteration and stored for use in this iteration) and thelocations of the intersection points 1128 ₂ and 1128 ₃ are used. Thestart tile is determined to be tile 1130 _(s) (in step S1016) becausethis tile includes the intersection point 1118 ₂. The end tile isdetermined to be tile 1130 _(e) (in step S1018) because this tileincludes the intersection point 1128 ₃. The tiles shown with hatching inFIG. 11c are determined to be in the primitive 1102 in step S1020because they are between (and including) the start and end tiles 1130_(s) and 1130 _(e). Therefore the primitive identifier for primitive1102 is added to the display lists for the tiles shown with hatching inFIG. 11c (in step S1022).

The method repeats for the next column (the fourth column), as shown inFIG. 11d . Since the fourth column is the last column in the boundingbox the method passes from step S1026 to steps S1016 and S1018 withoutperforming steps S1012 or S1014. This is because the tile boundary tothe right of the last column in the bounding box is the edge of thebounding box so the primitive will not cross this tile boundary. To findthe start and end tiles of the last column, the locations of theintersection points 1128 ₂ and 1128 ₃ (which were determined in theprevious iteration and stored for use in this iteration) and thelocation of the vertex 1032 are used. The start tile is determined to betile 1134 _(s) (in step S1016) because this tile includes theintersection point 1128 ₂. The end tile is determined to be tile 1134_(e) (in step S1018) because this tile includes the intersection point1128 ₃ and the vertex 1032. The tiles shown with hatching in FIG. 11dare determined to be in the primitive 1102 in step S1020 because theyare between (and including) the start and end tiles 1134 _(s) and 1134_(e). Therefore the primitive identifier for primitive 1102 is added tothe display lists for the tiles shown with hatching in FIG. 11d (in stepS1022).

Then in step S1024 it is determined that there are no more columns oftiles to process in the bounding box so the method passes to step S1028.In step S1028 the display lists for the tiles are output from the tilingunit 108 and stored in the memory 104 ₁. As described above, in examplesdescribed herein, whilst the display lists are being created they may bestored in the store 114 which is internal to the tiling unit 108. Insome examples, once all of the primitives for a render have been tiledthen the display lists are complete and they are passed to the off-chipmemory 104 ₁ for storage therein. As described above, in other examples,the tiling unit 108 might not use an internal store (such as store 114)to store display lists, and instead primitive identifiers may be writtendirectly to display lists in memory 104 ₁ as tiling is performed.Furthermore, in some further examples, the internal store 114 may beimplemented in the tiling unit 108, but the internal store 114 might notbe big enough to store all of the display lists for all of the tiles atonce. Therefore, the internal store 114 may be used to gather tilingresults that can then be written out to memory 104 ₁ in chunks (or“batches”) as the tiling is performed. This can avoid inefficient memoryaccess patterns when primitives are written to different display listsin memory 104 ₁.

The rendering unit 110 can then render the primitives in each of thetiles in accordance with the display lists. In order to render theprimitives for a tile, in step S1030 the rendering unit 110 retrievesthe display list from the memory 104 ₁ for the tile. The rendering unit110 can then retrieve the primitives indicated by the display list asbeing in the tile currently being rendered. These primitives may beretrieved from the memory 104 ₁. The rendering unit 110 then renders theprimitives in the tile. In the example shown in FIG. 1, the renderingunit 110 implements deferred rendering whereby hidden surface removal isperformed before texturing and/or shading, but in other examplesnon-deferred rendering may be implemented. In step S1032 the renderedresult is output and can be passed to the memory 104 ₂ for storage, e.g.in a frame buffer. The rendering unit 110 processes primitives in eachof the tiles and when the whole image has been rendered and stored inthe memory 104 ₂, the image can be outputted from the graphicsprocessing system 100 and, for example, displayed on a display.

In some situations, e.g. for primitives with large bounding boxes, themethod described with reference to FIGS. 10 and 11 a to 11 d may providea more efficient way of tiling a primitive compared to the examplesdescribed with reference to FIGS. 4 to 9. In contrast, in othersituations, e.g. for primitives with small bounding boxes, the methodsdescribed with reference to FIGS. 4 to 9 may provide a more efficientway of tiling a primitive compared to the examples described withreference to FIGS. 10 and 11 a to 11 d. In particular, the number ofcalculations performed in the method described with reference to FIGS.10 and 11 a to 11 d is linearly proportional to the minimum dimension ofthe bounding box (e.g. linearly proportional to the minimum of thenumber of columns of tiles and the number of rows of tiles in thebounding box). This is because for each of the lines (e.g. columns oftiles) except for the last line, the same number of calculations areperformed irrespective of how many tiles are in each line. For the lastline fewer calculations may be performed, as is apparent from thedescription above. For example, the same calculations would be performedfor a bounding box including a 20×4 group of tiles (i.e. 20 rows and 4columns) as would be performed in the example shown in FIGS. 11a to 11dfor a bounding box including a 6×4 group of tiles (i.e. 6 rows and 4columns). This is in contrast to the approaches described with referenceto FIGS. 4 to 9 in which the number of calculations performed for tilingis approximately proportional to the number of tiles in the boundingbox, e.g. approximately proportional to the area of the bounding box,which scales approximately with the minimum dimension of the boundingbox squared. Therefore, the method described with reference to FIGS. 10and 11 a to 11 d is particularly useful for processing primitives withlarge bounding boxes, and in particular for processing primitives withbounding boxes which are significantly longer in one dimension than inthe other dimension.

Therefore, in some embodiments, the tiling unit 108 may be capable ofimplementing the tiling method in two different ways: (i) method 1, i.e.as described with reference to the flow chart shown in FIGS. 4a and 4b ,and (ii) method 2, i.e. as described with reference to the flow chartshown in FIG. 10. The first two steps of the method are the same, i.e.the tiling unit receives the primitives and determines a bounding boxfor a primitive. The tiling unit 108 may then analyse the bounding boxto determine whether to perform method 1 or method 2. For example, ifthe maximum dimension of the bounding box is above a threshold number oftiles then the tiling unit 108 may proceed with method 2, whereas if themaximum dimension of the bounding box is not above the threshold numberof tiles then the tiling unit 108 may proceed with method 1. Other waysof selecting between method 1 and method 2 may be used in differentexamples, e.g. based on the area of the bounding box. In this manner,the way in which the primitives are tiled can be different for differentprimitives, and in particular can be selected to be well suited to thesize and/or shape of the primitive to thereby provide efficient tilingof the primitives.

The method steps of the flow charts shown in FIGS. 4a, 4b and 10 may beimplemented as logic blocks within the processing logic 112 of thetiling unit 108. The logic blocks may be implemented in hardware orsoftware or a combination thereof. For example, if the logic blocks areimplemented in hardware they may be formed as particular arrangements oftransistors and other hardware components suited for performing thedesired functions of the logic blocks as described herein. In contrast,if the logic blocks are implemented in software they may comprise setsof computer instructions which can be stored in a memory and can beprovided to the processing logic 112 for execution thereon to therebyprovide the functionality of the logic blocks.

The graphics processing system 100 described above can be implemented ina computer system. For example, FIG. 12 shows a computer system whichcomprises the GPU 102, a CPU 1202 and a memory 1204, wherein the memory1204 may include memory blocks corresponding to memories 104 ₁ and 104 ₂described above. The computer system also comprises other devices 1206,such as a display 1208, speakers 1210, a microphone 1212 and a camera1214. The components of the computer system can communicate with eachother via a communications bus 1216. Computer program code for anapplication may be stored in the memory 1204, and may for example beexecuted on the CPU 1202. If the application needs to render an image ofa 3D scene, the graphics data describing the primitives can be sent tothe GPU 102, and the GPU 102 can render the scene as described above.

Generally, any of the functions, methods, techniques or componentsdescribed above (e.g. the tiling unit 108 and its components) can beimplemented in modules using software, firmware, hardware (e.g., fixedlogic circuitry), or any combination of these implementations. The terms“module,” “functionality,” “component”, “block”, “unit” and “logic” areused herein to generally represent software, firmware, hardware, or anycombination thereof.

In the case of a software implementation, the module, functionality,component, unit or logic represents program code that performs specifiedtasks when executed on a processor (e.g. one or more CPUs). In oneexample, the methods described may be performed by a computer configuredwith software in machine readable form stored on a computer-readablemedium. One such configuration of a computer-readable medium is signalbearing medium and thus is configured to transmit the instructions (e.g.as a carrier wave) to the computing device, such as via a network. Thecomputer-readable medium may also be configured as a non-transitorycomputer-readable storage medium and thus is not a signal bearingmedium. Examples of a computer-readable storage medium include arandom-access memory (RAM), read-only memory (ROM), an optical disc,flash memory, hard disk memory, and other memory devices that may usemagnetic, optical, and other techniques to store instructions or otherdata and that can be accessed by a machine.

The software may be in the form of a computer program comprisingcomputer program code for configuring a computer to perform theconstituent portions of described methods or in the form of a computerprogram comprising computer program code means adapted to perform allthe steps of any of the methods described herein when the program is runon a computer and where the computer program may be embodied on acomputer readable medium. The program code can be stored in one or morecomputer readable media. The features of the techniques described hereinare platform-independent, meaning that the techniques may be implementedon a variety of computing platforms having a variety of processors.

Those skilled in the art will also realize that all, or a portion of thefunctionality, techniques or methods may be carried out by a dedicatedcircuit, an application-specific integrated circuit, a programmablelogic array, a field-programmable gate array, or the like. For example,the module, functionality, component, unit or logic (e.g. the logicblocks implemented within the processing logic 112 of the tiling unit108) may comprise hardware in the form of circuitry. Such circuitry mayinclude transistors and/or other hardware elements available in amanufacturing process. Such transistors and/or other elements may beused to form circuitry or structures that implement and/or containmemory, such as registers, flip flops, or latches, logical operators,such as Boolean operations, mathematical operators, such as adders,multipliers, or shifters, and interconnects, by way of example. Suchelements may be provided as custom circuits or standard cell libraries,macros, or at other levels of abstraction. Such elements may beinterconnected in a specific arrangement. The module, functionality,component, unit or logic (e.g. the logic blocks within the processinglogic 112) may include circuitry that is fixed function and circuitrythat can be programmed to perform a function or functions; suchprogramming may be provided from a firmware or software update orcontrol mechanism. In an example, hardware logic has circuitry thatimplements a fixed function operation, state machine or process.

It is also intended to encompass software which “describes” or definesthe configuration of hardware that implements a module, functionality,component, unit or logic described above, such as HDL (hardwaredescription language) software, as is used for designing integratedcircuits, or for configuring programmable chips, to carry out desiredfunctions. That is, there may be provided a computer readable storagemedium having encoded thereon computer readable program code forgenerating a graphics processing system configured to perform any of themethods described herein, or for generating a graphics processing systemcomprising any apparatus described herein. That is, a computer systemmay be configured to generate a representation of a digital circuit fromdefinitions of circuit elements and data defining rules for combiningthose circuit elements, wherein a non-transitory computer readablestorage medium may have stored thereon processor executable instructionsthat when executed at such a computer system, cause the computer systemto generate a graphics processing system, e.g. comprising a tiling unitas described in the examples herein.

The term ‘processor’ and ‘computer’ are used herein to refer to anydevice, or portion thereof, with processing capability such that it canexecute instructions, or a dedicated circuit capable of carrying out allor a portion of the functionality or methods, or any combinationthereof.

Although the subject matter has been described in language specific tostructural features and/or methodological acts, it is to be understoodthat the subject matter defined in the appended claims is notnecessarily limited to the specific features or acts described above.Rather, the specific features and acts described above are disclosed asexample forms of implementing the claims. It will be understood that thebenefits and advantages described above may relate to one example or mayrelate to several examples.

Any range or value given herein may be extended or altered withoutlosing the effect sought, as will be apparent to the skilled person. Thesteps of the methods described herein may be carried out in any suitableorder, or simultaneously where appropriate. Aspects of any of theexamples described above may be combined with aspects of any of theother examples described to form further examples without losing theeffect sought.

1. A method of processing a primitive in a graphics processing system,the method comprising tiling the primitive to determine which of aplurality of tiles of a rendering space the primitive is in, bydetermining a bounding box for the primitive; for each of at least onetile boundary between lines of tiles in the bounding box, determiningintersection points of the tile boundary with edges of the primitive;and using the determined intersection points to determine which of thetiles in the bounding box the primitive is in; and storing dataindicating which of the tiles in the bounding box the primitive is in.2. The method of claim 1 wherein said determining intersection points ofthe tile boundary with edges of the primitive comprises: determininginitial intersection points of the tile boundary with edge linesdefining edges of the primitive; and identifying which of those initialintersection points lie on the edge of the primitive, wherein theidentified initial intersection points are the determined intersectionpoints which are used to determine which of the tiles in the boundingbox the primitive is in.
 3. The method of claim 1 wherein the step ofusing the determined intersection points to determine which of the tilesin the bounding box the primitive is in comprises, for a line of tiles:determining a start tile in the line of tiles by finding the first tilein the line which includes a determined intersection point on itsboundary or includes a vertex of the primitive; determining an end tilein the line of tiles by finding the last tile in the line which includesa determined intersection point on its boundary or includes a vertex ofthe primitive; determining that the primitive is in the tiles in theline between, and including, the start tile and the end tile.
 4. Themethod of claim 1 wherein the lines of tiles are rows or columns oftiles.
 5. The method of claim 1 further comprising: determining that thelines of tiles are rows of tiles if there are fewer rows of tiles thancolumns of tiles in the bounding box; and determining that the lines oftiles are columns of tiles if there are fewer columns of tiles than rowsof tiles in the bounding box.
 6. The method of claim 1 wherein theprimitive is determined to not be in tiles which do not at leastpartially overlap with the bounding box.
 7. The method of claim 1wherein the bounding box is clipped so that it does not extend beyondthe edges of the rendering space.
 8. The method of claim 1 furthercomprising including a primitive identifier of the primitive in adisplay list for a particular tile if it is determined that theprimitive is in the particular tile.
 9. The method of claim 8 furthercomprising, for each of the tiles of the rendering space, rendering theprimitives in the tile in accordance with the display list for thattile.
 10. A graphics processing system comprising a tiling unit fortiling a primitive to determine which of a plurality of tiles of arendering space the primitive is in, the tiling unit being configuredto: determine a bounding box for the primitive; for each of at least onetile boundary between lines of tiles in the bounding box, determineintersection points of the tile boundary with edges of the primitive;use the determined intersection points to determine which of the tilesin the bounding box the primitive is in; and store data indicating whichof the tiles in the bounding box the primitive is in.
 11. The graphicsprocessing system of claim 10 wherein the tiling unit is configured todetermine intersection points of the tile boundary with edges of theprimitive by: determining initial intersection points of the tileboundary with edge lines defining edges of the primitive; andidentifying which of those initial intersection points lie on the edgeof the primitive, wherein the identified initial intersection points arethe determined intersection points which are to be used to determinewhich of the tiles in the bounding box the primitive is in.
 12. Thegraphics processing system of claim 10 wherein the tiling unit isconfigured to use at least some of the determined intersection points todetermine which of the tiles in the bounding box the primitive is in by,for a line of tiles: determining a start tile in the line of tiles byfinding the first tile in the line which includes a determinedintersection point on its boundary or includes a vertex of theprimitive; determining an end tile in the line of tiles by finding thelast tile in the line which includes a determined intersection point onits boundary or includes a vertex of the primitive; determining that theprimitive is in the tiles in the line between, and including, the starttile and the end tile.
 13. The graphics processing system of claim 10wherein the lines of tiles are rows or columns of tiles.
 14. Thegraphics processing system of claim 10 wherein the tiling unit isfurther configured to: determine that the lines of tiles are rows oftiles if there are fewer rows of tiles than columns of tiles in thebounding box; and determine that the lines of tiles are columns of tilesif there are fewer columns of tiles than rows of tiles in the boundingbox.
 15. The graphics processing system of claim 10 wherein the tilingunit is configured to determine that the primitive is not in tiles whichdo not at least partially overlap with the bounding box.
 16. Thegraphics processing system of claim 10 wherein the tiling unit isconfigured to clip the bounding box so that it does not extend beyondthe edges of the rendering space.
 17. The graphics processing system ofclaim 10 wherein the tiling unit is further configured to include aprimitive identifier of the primitive in a display list for a particulartile if it is determined that the primitive is in the particular tile.18. The graphics processing system of claim 17 further comprising arendering unit configured to render, for each of the tiles of therendering space, the primitives in the tile in accordance with thedisplay list for the tile.
 19. A non-transitory computer readablestorage medium having stored thereon computer executable instructionsthat when executed cause at least one processor to process a primitivein a graphics processing system, to determine which of a plurality oftiles of a rendering space the primitive is in, by determining abounding box for the primitive; for each of at least one tile boundarybetween lines of tiles in the bounding box, determining intersectionpoints of the tile boundary with edges of the primitive; using thedetermined intersection points to determine which of the tiles in thebounding box the primitive is in; and storing data indicating which ofthe tiles in the bounding box the primitive is in.
 20. A non-transitorycomputer readable storage medium having stored thereon computer readablecode for generating a graphics processing system comprising a tilingunit for tiling a primitive to determine which of a plurality of tilesof a rendering space the primitive is in, the tiling unit beingconfigured to: determine a bounding box for the primitive; for each ofat least one tile boundary between lines of tiles in the bounding box,determine intersection points of the tile boundary with edges of theprimitive; use the determined intersection points to determine which ofthe tiles in the bounding box the primitive is in; and store dataindicating which of the tiles in the bounding box the primitive is in.